FAST H-WAVES IN DOUBLE COMB INFINITE ARRAYS
نویسندگان
چکیده
منابع مشابه
Infinite Arrays and Infinite Computations
A complete metric ttipology is introduced on the set of :il finite and infinite arrays and the topological properties of the space are studied. In this complete metric topolor,y, infinite arrays are the limits of increasing sequences of finite arrays. The n.>tion of successful infinite derivations in Generalized Context-free Kolam Array Grammars, yielding infinif e arrays, is introduced. This c...
متن کاملProgressing Waves in an Infinite Nonlinear String
This equation governs the small transverse displacement of a uniform taut string constrained by distributed nonlinear "springs" exerting a force —au—Pu*. The spring constants a and P, also the variables t, x and u, are real-valued. The string is assumed to be of infinite length. We wish to determine the types of waves which propagate in this medium at constant speed, and their propagation speed...
متن کاملThermoelastic waves in an anisotropic infinite plate
An analysis of the propogation of thermoelastic waves in a homogeneous, anisotropic, thermally conducting plate has been presented in the context of the generalized Lord-Shulman theory of thermoelasticity. Three different methods are used in this analysis: two of them are exact and the third is a semianalytic finite element method (SAFE). In our exact analysis, two different approaches are used...
متن کاملComb to Pipeline: Fast Software Encryption Revisited
AES-NI, or Advanced Encryption Standard New Instructions, is an extension of the x86 architecture proposed by Intel in 2008. With a pipelined implementation utilizing AES-NI, parallelizable modes such as AES-CTR become extremely efficient. However, out of the four non-trivial NIST-recommended encryption modes, three are inherently sequential: CBC, CFB, and OFB. This inhibits the advantage of us...
متن کاملH-Kernels in Infinite Digraphs
Let H be a digraph possibly with loops and D a digraph (possibly infinite) without loops whose arcs are coloured with the vertices of H (D is an H-coloured digraph). V(D) and A(D) will denote the sets of vertices and arcs of D respectively. A directed walk or a directed pathW in D is an H-walk or an H-path if and only if the consecutive colors encountered onW form a directed walk in H. A set N ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress In Electromagnetics Research C
سال: 2018
ISSN: 1937-8718
DOI: 10.2528/pierc17091406